Smart Geodesic Tracing in GRworkbench

We have developed a new tool for numerical work in General Relativity: GRworkbench. We discuss how GRworkbench's implementation of a numerically-amenable analogue to Differential Geometry facilitates the development of robust and chart-independent numerical algorithms. We consider, as an example, geodesic tracing on two charts covering the exterior Schwarzschild space-time.     

Primal cutting plane algorithms revisited

Dual fractional cutting plane algorithms, in which cutting planes are used to iteratively tighten a linear relaxation of an integer program, are well-known and form the basis of the highly successful branch-and-cut method. It is rather less well-known that various primal cutting plane algorithms were developed in the 1960s, for example by Young. In a primal algorithm, the main role of the cutting planes is to enable a feasible solution to the original problem to be improved. Research on these algorithms has been almost non-existent.  In this paper we argue for a re-examination of these primal methods. We describe a new primal algorithm for pure 0-1 problems based on strong valid inequalities and give some encouraging computational results. Possible extensions to the case of general mixed-integer programs are also discussed.     

ON A LINEAR DELAY DIFFERENCE EQUATION WITH IMPULSES

IIntroductlonLet N denote the set of all Integers．FOr any a;b E N,define N(a)＝{a,a＋1,…},N(a,b)二{a,a＋1,…,b}when a＜b．Consider the dlf卜巳renceequationl 凸x。＋P。x。－。＝0;nEN(0)andN4n。;2—“－””’”门二l0 凸X。,＝~X。,,JENO);where A denotes the forward difference operator八。。＝x。＋l一 x。,{P。} Isa sequence ofnon－negative real numbers,{nj}Is a sequence ofnon－negativeIntegers with nj＜nj＋lfor j E N(1)and nj一 co as ;一 co,{4}Is a sequence。I优。且皿mb ers,…     

Attractors and Dimensions for Discretizations of a Dissipative Zakharov Equations

Abstract In this paper, a dissipative Zakharov equations are discretized by difference method.We make priorestimates for the algebric system of equations. It is proved that for each mesh size,there exist attractors forthe discretized system.The bounds of the Hausdorff dimensions of the discrete attractors are obtained,and thevarious bounds are dependent of the mesh sizes.     

The mapping properties of the radiosity operator along an edge

In this article we study the radiosity operator along an edge between two adjacent half‐planes. First we show that the radiosity operator is invertible in a whole scale of anisotropic Sobolev spaces. In the absence of any shadows we are able to derive regularity properties of the solution, which depend only on the angle between the half‐planes, the reflectivity coefficients and the right‐hand side. This work can be considered as a supplement to the article of Rathsfeld (Mathematical Methods in the Applied Sciences 1999; 22 : 217–241). Copyright © 2002 John Wiley & Sons, Ltd.     

Global Phase Time and Wave Function for the Kantowski-Sachs Anisotropic Universe

A consistent quantization with a clear notion of time and evolution is given for the anisotropic Kantowski–Sachs cosmological model. It is shown that a suitable coordinate choice allows to obtain a solution of the Wheeler–DeWitt equation in the form of definite energy states, and that the results can be associated to two disjoint equivalent theories, one for each sheet of the constraint surface.     

A primer on perfect simulation for spatial point processes

This primer provides a self-contained exposition of the case where spatial birth-and-death processes are used for perfect simulation of locally stable point processes. Particularly, a simple dominating coupling from the past (CFTP) algorithm and the CFTP algorithms introduced in [13], [14], and [5] are studied. Some empirical results for the algorithms are discussed. Received: 30 June 2002